Standard Software Routines for FASTBUS

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applicability of the Fastbus Standard

The new FASTBUS standard has been designed to provide a framework for distributed processing in both experimental data acquisition and accelerator control. The features of FASTBUS which support distributed control are a priority arbitration scheme which allows intercrate as well as intracrate message flow between processors and slave devices; and a high bandwidth to permit efficient sharing of ...

متن کامل

Status of the Fastbus Standard Data

FASTBUS is a new laboratory standard data bus intended for use in experimental data acquisition and control. The development of FASTBUS began with a feasibility study in 1976 and is presently at the development prototyping stage. The principal aims of the standard are to provide a factor of ten or more improvement in speed of data transfers over present systems, as well as to provide an archite...

متن کامل

To the Fastbus Standard Data Bus

The FASTBUS standard data bus is a development of the US NIM' Committee of the National Bureau of Standards. Although originally conceived to provide an upgraded framework for the high data rate experimental apparatus of nuclear particle physics, the system is designed with sufficient generality to support a broad range of data acquisition as well as control applications. FASTBUS is based on an...

متن کامل

Temporal Routines for Generational Product Innovation in Computer Software

This study uses a routines-based theoretical lens to examine time-based pacing of generational product innovation in the applications software industry. We develop a temporal routines model to explain the effect of time since previous innovation on generational product innovation. The model further suggests that organizational size moderates the time-pacing relationship. Employing event history...

متن کامل

Software for Computing Standard Representations

Let GR be the real points of a complex connected reductive algebraic group G. Let KR be a maximal compact subgroup of GR . We describe an algorithm for computing restrictions of standard representations of GR to KR . We are currently implementing the algorithm as a package of the Atlas of Lie Groups and Representations software developed by Fokko du Cloux.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Nuclear Science

سال: 1981

ISSN: 0018-9499

DOI: 10.1109/tns.1981.4331853